package org.hot100_1;

public class leetcode58 {

    //左闭右闭
    public int searchInsert(int[] nums, int target) {
        int left = 0;
        int right = nums.length-1;

        while (left<=right){
            int mid =(left+right)>>>1;

            if (nums[mid]<target){
                left=mid+1;
            }else if (target<nums[mid]){
                right=mid-1;
            }else {
                return mid;
            }
        }

        return left;

    }



}
